Parallel Simulated Annealing on a Flexible Multi-DSP System
نویسندگان
چکیده
This paper presents parallel simulated annealing techniques realized on a multiDSP system with distributed memory and a point-to-point communication structure. Four parallelization techniques are assessed. The main aspects of our research are solution quality, computation time, speedup and scalability. Finally, experimental results for typical NP-hard problems with di erent complexity are compared to each other.
منابع مشابه
Comparing Parallel Simulated Annealing, Parallel Vibrating Damp Optimization and Genetic Algorithm for Joint Redundancy-Availability Problems in a Series-Parallel System with Multi-State Components
In this paper, we study different methods of solving joint redundancy-availability optimization for series-parallel systems with multi-state components. We analyzed various effective factors on system availability in order to determine the optimum number and version of components in each sub-system and consider the effects of improving failure rates of each component in each sub-system and impr...
متن کاملA Model for Scheduling and Mapping DSP Applications onto Multi-DSP Platforms
In this paper, we present a basic model for describing hardand software of heterogeneous multi-DSP systems. The software part consists of a task model that has been tuned to suit typical, cyclic DSP applications. Hardware is described by a processor model adapted to multi-DSP systems with point-to-point communication structure, which also includes an exact model of communication timing behavior...
متن کاملA Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations
In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...
متن کاملَA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کاملHybrid artificial immune system and simulated annealing algorithms for solving hybrid JIT flow shop with parallel batches and machine eligibility
This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...
متن کامل